Bivariate Lagrange Interpolation at the Chebyshev Nodes
نویسندگان
چکیده
We discuss Lagrange interpolation on two sets of nodes in two dimensions where the coordinates of the nodes are Chebyshev points having either the same or opposite parity. We use a formula of Xu for Lagrange polynomials to obtain a general interpolation theorem for bivariate polynomials at either set of Chebyshev nodes. An extra term must be added to the interpolation formula to handle all polynomials with the same degree as the Lagrange polynomials. We express this term as a specifically determined linear combination of canonical polynomials that vanish on the set of Chebyshev nodes being considered. As an application we deduce in an elementary way known minimal and near minimal cubature formulas applying to both the even and the odd Chebyshev nodes. Finally, we restrict to triangular subsets of the Chebyshev nodes to show unisolvence and deduce a Lagrange interpolation formula for bivariate symmetric and skew-symmetric polynomials. This result leads to another proof of the interpolation formula.
منابع مشابه
A novel technique for a class of singular boundary value problems
In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...
متن کاملBivariate Interpolation at Xu Points: Results, Extensions and Applications
In a recent paper, Y. Xu proposed a set of Chebyshev-like points for polynomial interpolation on the square [−1, 1]. We have recently proved that the Lebesgue constant of these points grows like log of the degree (as with the best known points for the square), and we have implemented an accurate version of their Lagrange interpolation formula at linear cost. Here we construct non-polynomial Xu-...
متن کاملLebesgue constants in polynomial interpolation
Lagrange interpolation is a classical method for approximating a continuous function by a polynomial that agrees with the function at a number of chosen points (the “nodes”). However, the accuracy of the approximation is greatly influenced by the location of these nodes. Now, a useful way to measure a given set of nodes to determine whether its Lagrange polynomials are likely to provide good ap...
متن کاملA bivariate Markov inequality for Chebyshev polynomials of the second kind
This note presents a Markov-type inequality for polynomials in two variables where the Chebyshev polynomials of the second kind in either one of the variables are extremal. We assume a bound on a polynomial at the set of even or odd Chebyshev nodes with the boundary nodes omitted and obtain bounds on its even or odd order directional derivatives in a critical direction. Previously, the author h...
متن کاملLagrange Interpolation on Chebyshev Points of Two Variables
We study interpolation polynomials based on the points in [−1, 1]× [−1, 1] that are common zeros of quasi-orthogonal Chebyshev polynomials and nodes of near minimal degree cubature formula. With the help of the cubature formula we establish the mean convergence of the interpolation polynomials. 1991 Mathematics Subject Classification: Primary 41A05, 33C50.
متن کامل